Period Distribution of Inversive Pseudorandom Number Generators Over Galois Rings
نویسندگان
چکیده
In 2009, Solé and Zinoviev (Eur. J. Combin., vol. 30, no. 2, pp. 458-467, 2009) proposed an open problem of arithmetic interest to study the period of the inversive pseudorandom number generators (IPRNGs) and to give conditions bearing on a, b to achieve maximal period, we focus on resolving this open problem. In this paper, the period distribution of the IPRNGs over the Galois ring (Zpe ,+,×) is considered, where p > 3 is a prime and e ≥ 2 is an integer. The IPRNGs are transformed to 2-dimensional linear feedback shift registers (LFSRs) so that the analysis of the period distribution of the IPRNGs is transformed to the analysis of the period distribution of the LFSRs. Then, by employing some analytical approaches, the full information on the period distribution of the IPRNGs is obtained, which is to make exact statistics about the period of the IPRNGs then count the number of IPRNGs of a specific period when a, b and x0 traverse all elements in Zpe . The analysis process also indicates how to choose the parameters and the initial values such that the IPRNGs fit specific periods.
منابع مشابه
Period Distribution of Inversive Pseudorandom Number Generators Over Finite Fields
In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field (ZN ,+,×), where N > 3 is a prime. The sequences generated by the IPRNGs are transformed to 2-dimensional linear feedback shift register (LFSR) sequences. By employing the generating function method and the finite field theory, the period distribution is obtain...
متن کاملCompound Inversive Congruential Generator Design Algorithm
In this paper we present an algorithm for the compound method of designing generators as pseudorandom stream sources. Compound method relies on a technique of combining two or more inversive congruential generators. Experiments on congruential methods showed that even if all tested generators have maximum period not all produced binary sequences have the linear complexity of the same value. We ...
متن کاملOn the Distribution of Some New Explicit Inversive Pseudorandom Numbers and Vectors
Inversive methods are attractive alternatives to the linear method for pseudorandom number generation. A particularly attractive method is the new explicit inversive method recently introduced by Meidl and the author. We present nontrivial results on the distribution of pseudorandom numbers and vectors generated by this method over the full period and in parts of the period. Moreover, we establ...
متن کاملOn a nonlinear congruential pseudorandom number generator
A nonlinear congruential pseudorandom number generator with modulus M = 2w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.
متن کاملPseudorandom Number Generation by Inversive Methods
The classical linear congruential method for generating uniform pseudorandom numbers has some deficiencies that can render them useless for some simulation problems. This fact motivated the design and analysis of nonlinear congruential methods for the generation of pseudorandom numbers. Inversive methods are an interesting and very promising approach to produce uniform pseudorandom numbers. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1208.2488 شماره
صفحات -
تاریخ انتشار 2012